Modular adjacency algebras of Grassmann graphs
نویسندگان
چکیده
The adjacency algebra of an association scheme is defined over an arbitrary field. In general, it is always semisimple over a field of characteristic zero but not always semisimple over a field of positive characteristic. The structures of adjacency algebras over fields of positive characteristic have not been sufficiently studied. In this paper, we consider the structures of adjacency algebras of some P -polynomial schemes of class d with intersection numbers ci ̸≡ 0 modulo p for 1 ≤ i ≤ d over fields of positive characteristic p. The classes of these P polynomial schemes include association schemes originating from Grassmann graphs, double Grassmann graphs, and all types of dual polar graphs. We discuss the structures of the modular adjacency algebras of Grassmann graphs.
منابع مشابه
Reciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملOpposite Relation on Dual Polar Spaces and Half-spin Grassmann Spaces
We characterize the collinearity (adjacency) relation of dual polar spaces and half-spin Grassmann spaces in terms of the relation to be opposite in the corresponding collinearity graphs. Our characterization is closely related with results given [1] and [2].
متن کاملThe Smith Group and the Critical Group of the Grassmann Graph of Lines in Finite Projective Space and of Its Complement
We compute the elementary divisors of the adjacency and Laplacian matrices of the Grassmann graph on 2-dimensional subspaces in a finite vector space. We also compute the corresponding invariants of the complementary graphs.
متن کاملNilpotent Adjacency Matrices and Random Graphs
While powers of the adjacency matrix of a finite graph reveal information about walks on the graph, they fail to distinguish closed walks from cycles. Using elements of an appropriate commutative, nilpotentgenerated algebra, a “new” adjacency matrix can be associated with a random graph on n vertices and |E| edges of nonzero probability. Letting Xk denote the number of k-cycles occurring in a r...
متن کاملA Generalization of Strongly Regular Graphs
Motivated from an example of ridge graphs relating to metric polytopes, a class of connected regular graphs such that the squares of their adjacency matrices are in certain symmetric Bose-Mesner algebras of dimension 3 is considered in this paper as a generalization of strongly regular graphs. In addition to analysis of this prototype example defined over ðMetP5Þ , some general properties of th...
متن کامل